Research on DNA Computing Methods of Optimization Problems on Weighted Graph

The paper researched the DNA computing method of classical optimization problems on weighted graph, improved the method of Weight-coding that belongs to the original model of DNA, raised some new methods of DNA encoding and DNA computing. Generally speaking, through the Relative length graph design that belongs to an Undirected weighted graph , given DNA coding and DNA computing a new method by Traveling salesman problems and Chinese mail carrier problems that based on the General line graph of an Undirected weighted graph. And the same time, through the Inverse optimal alignment of DNA sequence given the DNA cording and DNA computing a new method. The method based on the Optimal alignment which one of the Minimum spanning tree problems. Thought the Polynomial transformation about the Vertex cover problems that was the way to improve the Polynomial transformation form Vertex cover problem to Hamiltonian path. The new computing method improved the ability to express and deal with figures during DNA computing.